Greedy defining sets in graphs and Latin squares
نویسنده
چکیده
Greedy algorithm sometimes uses more than χ(G) colors while coloring a graph G. A greedy defining set is an object to eliminate these extra colors so that the greedy coloring results in a minimum coloring of an order graph G. In this note we report some of the previous results as well as new results on greedy defining sets of graphs and Latin squares.
منابع مشابه
More results on greedy defining sets
The greedy defining sets of graphs were appeared first time in [M. Zaker, Greedy defining sets of graphs, Australas. J. Combin, 2001]. We show that to determine the greedy defining number of bipartite graphs is an NP-complete problem. This result answers affirmatively the problem mentioned in the previous paper. It is also shown that this number for forests can be determined in polynomial time....
متن کاملMore greedy defining sets in Latin squares
A Greedy Defining Set is a set of entries in a Latin Square with the property that when the square is systematically filled in with a greedy algorithm, the greedy algorithm succeeds. Let g(n) be the smallest defining set for any Latin Square of order n. We give theorems on the upper bounds of gn and a table listing upper bounds of gn for small values of n. For a circulant Latin square, we find ...
متن کاملDefining sets in vertex colorings of graphs and latin rectangles
In a given graph G, a set of vertices S with an assignment of colors is said to be a defining set o f the vertex coloring o f G, if there exists a unique extension of the colors of S to a z(G)coloring of the vertices of G. The concept of a defining set has been studied, to some extent, for block designs and also under another name, a critical set, for latin squares. In this note we extend this ...
متن کاملSteiner Trades That Give Rise to Completely Decomposable Latin Interchanges
In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decomposed into six disjoint latin interchanges. 1 Background information In any combinatorial configuration it is possible to identify a subset which uniquely determines the structure of the configuration and in some cases i...
متن کاملDefining Sets and Uniqueness in Graph Colorings: a Survey
There are different ways of coloring a graph, namely vertex coloring, edge coloring, total coloring, list coloring, etc. Literature is full of fascinating papers and even books and monographs on this subject. This note will briefly survey some results on two concepts in graph colorings. First we discuss the uniqueness of graph colorings and then we introduce the concept of defining sets on this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 24 شماره
صفحات -
تاریخ انتشار 2006